Invertible polynomial mappings via Newton non-degeneracy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Invertible polynomial mappings via Newton non-degeneracy

We prove a sufficient condition for the Jacobian problem in the setting of real, complex and mixed polynomial mappings. This follows from the study of the bifurcation locus of a mapping subject to a new Newton non-degeneracy condition.

متن کامل

Locally Invertible Boolean Mappings

The aim of this paper is to study a novel property of Boolean mappings called local intert-ibility. We focus on local invertibility of Boolean mappings which model ltering generators and study the case when ltering function is linear in the last variable.

متن کامل

On orthogonal polynomials obtained via polynomial mappings

Let (pn)n be a given monic orthogonal polynomial sequence (OPS) and k a fixed positive integer number such that k ≥ 2. We discuss conditions under which this OPS originates from a polynomial mapping in the following sense: to find another monic OPS (qn)n and two polynomials πk and θm , with degrees k and m (resp.), with 0 ≤ m ≤ k − 1, such that pnk+m(x) = θm(x)qn(πk(x)) (n = 0, 1, 2, . . .). In...

متن کامل

Affine Mappings of Invertible Operators

The infinite-dimensional analogues of the classical general linear group appear as groups of invertible elements of Banach algebras. Mappings of these groups onto themselves that extend to affine mappings of the ambient Banach algebra are shown to be linear exactly when the Banach algebra is semi-simple. The form of such linear mappings is studied when the Banach algebra is a C*-algebra.

متن کامل

Invertible Polynomial Representation for Private Set Operations

In many private set operations, a set is represented by a polynomial over a ring Zσ for a composite integer σ, where Zσ is the message space of some additive homomorphic encryption. While it is useful for implementing set operations with polynomial additions and multiplications, a polynomial representation has a limitation due to the hardness of polynomial factorizations over Zσ. That is, it is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l’institut Fourier

سال: 2014

ISSN: 0373-0956,1777-5310

DOI: 10.5802/aif.2897